Homomorphic Encryption Schemes: Steps to Improve the Proficiency

ثبت نشده
چکیده

Homomorphic encryption schemes are malleable by design. In this paper, we find different approaches to practical homomorphic encryption schemes. Partial homomorphic encryption schemes, we observe that the main bottleneck of this scheme is that it is capable of or adapted for turning easily from one to another of various tasks. To solve this problem, we propose general approach to improve the versatility of this scheme by extending the message space. This can be applied to a wide range of partial homomorphic encryption schemes and also increase the application of this scheme. Fully homomorphic encryption schemes, we observe that the main bottleneck for this scheme is slow running speed and large cipher text. For this, we propose to compress the cipher text. For cipher text compression, the concept of scheme conversion is proposed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Bid Validity Check in ElGamal-Based Sealed-Bid E-Auction

Bid opening in sealed-bid e-auction is efficient when a homomorphic encryption algorithm is employed to seal the bids and homomorphic bid opening is employed to open the bids. Such e-auction schemes are called homomorphic auctions. However, high efficiency of homomorphic auctions is based on an assumption: the bids are valid (e.g. within a special range). An undetected invalid bid can compromis...

متن کامل

Targeting FPGA DSP Slices for a Large Integer Multiplier for Integer Based FHE

Homomorphic encryption offers potential for secure cloud computing. However due to the complexity of homomorphic encryption schemes, performance of implemented schemes to date have been unpractical. This work investigates the use of hardware, specifically Field Programmable Gate Array (FPGA) technology, for implementing the building blocks involved in somewhat and fully homomorphic encryption s...

متن کامل

Shift-Type Homomorphic Encryption and Its Application to Fully Homomorphic Encryption

This work addresses the characterization of homomorphic encryption schemes both in terms of security and design. In particular, we are interested in currently existing fully homomorphic encryption (FHE) schemes and their common structures and security. Our main contributions can be summarized as follows: – We define a certain type of homomorphic encryption that we call shift-type and identify i...

متن کامل

Partially Homomorphic Encryption Schemes over Finite Fields

Homomorphic encryption scheme enables computation in the encrypted domain, which is of great importance because of its wide and growing range of applications. The main issue with the known fully (or partially) homomorphic encryption schemes is the high computational complexity and large communication cost required for their execution. In this work, we study symmetric partially homomorphic encry...

متن کامل

On the depth complexity of homomorphic encryption schemes

We show that secure homomorphic evaluation of any non-trivial functionality of sufficiently many inputs with respect to any CPA secure encryption scheme cannot be implemented by constant depth, polynomial size circuits, i.e. in the class AC. In contrast, we observe that certain previously studied encryption schemes (with quasipolynomial security) can be implemented in AC. We view this as eviden...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016